An Efficient Method for Eliminating Varying Predicates from a Circumscription

Circumscription appears to be the most powerful and well-studied technique used in formalizing common-sense reasoning. The general form of predicate circumscrip-tion allows for xed and varying ((oating) predicates. We show that the inference problem under this form of circumscription is eeciently reducible to inferencing under circumscription without varying predicates. In fact, we transform this problem even into circumscription without xed and varying predicates, that is where all predicates are minimized. Thus any theorem prover or algorithm for inferencing under circum-scription without xed and varying predicates is able to handle inferencing under the general form of predicate circumscription. As a consequence, algorithms that compute circumscription for an inference task can be simpliied.